Note on Salié’s sum
نویسندگان
چکیده
منابع مشابه
A Note on Chromatic Sum
The chromatic sum Σ(G) of a graph G is the smallest sum of colors among of proper coloring with the natural number. In this paper, we introduce a necessary condition for the existence of graph homomorphisms. Also, we present Σ(G) < χf (G)|G| for every graph G.
متن کاملNote on a Zero-Sum Problem
Let G be an additively written, finite abelian group, and exp(G ) its exponent. Let S=(a1 , ..., ak) be a sequence of elements in G; we say that S is a zero-sum sequence if i=1 ai=0. Let s(G ) be the samllest integer t such that every sequence of t elements in G contains a zero-sum subsequence of length exp(G ). This constant has been studied by serveral authors during last 20 years [1 9, 11]. ...
متن کاملA Note on the Block Sum Transformation
In a recent paper, Bourchard et al. [1] proposed the block sum transformation, a method intended as an alternative to the discrete Fourier transform (DFT), with application to the analysis of excited vibrations of linear systems. In this note, we mention the existence of a number of alternative algorithms for the computation of the DFT, and show that the block sum transformation is equivalent t...
متن کاملA note on two-person zero-sum communicating stochastic games
For undiscounted two-person zero-sum communicating stochastic games with finite state and action spaces, a solution procedure is proposed that exploits the communication property, i.e., working with irreducible games over restricted strategy spaces. The proposed procedure gives the value of the communicating game with an arbitrarily small error when the value is independent of the initial state.
متن کاملA note on the generalized min-sum set cover problem
In this paper, we consider the generalized min-sum set cover problem, introduced by Azar, Gamzu, and Yin [1]. Bansal, Gupta, and Krishnaswamy [2] give a 485approximation algorithm for the problem. We are able to alter their algorithm and analysis to obtain a 28-approximation algorithm, improving the performance guarantee by an order of magnitude. We use concepts from α-point scheduling to obtai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1971
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1971-0284408-5